Alpha Galois Lattices: An Overview
نویسندگان
چکیده
What we propose here is to reduce the size of Galois lattices still conserving their formal structure and exhaustivity. For that purpose we use a preliminary partition of the instance set, representing the association of a “type” to each instance. By redefining the notion of extent of a term in order to cope, to a certain degree (denoted as α), with this partition, we define a particular family of Galois lattices denoted as Alpha Galois lattices. We also discuss the related implication rules defined as inclusion of such α-extents and show that Iceberg concept lattices are Alpha Galois lattices where the partition is reduced to one single class.
منابع مشابه
Les treillis de Galois Alpha
Our basic representation of the data is a Galois lattice, i.e. a lattice in which the terms of a representation language are partitioned into equivalence classes w.r.t. their extent (the extent of a term is the part of the instance set that satisfies the term). We propose here to simplify our view of the data, still conserving the Galois lattice formal structure. For that purpose we use a preli...
متن کاملZooM : Alpha Galois Lattices for Conceptual Clustering
The main drawback of Galois lattices is that their size can be very large when dealing with real-world data sets. One way to reduce the number of nodes is to use a language with a weak expressivity. In this paper, we propose an approach based on the new notion of alpha extension where the number of nodes is reduced according to a change of the extensional function.
متن کاملIncremental Construction of Alpha Lattices and Association Rules
In this paper we discuss Alpha Galois lattices (Alpha lattices for short) and the corresponding association rules. An alpha lattice is coarser than the related concept lattice and so contains fewer nodes, so fewer closed patterns, and a smaller basis of association rules. Coarseness depends on a a priori classification, i.e. a cover C of the powerset of the instance set I, and on a granularity ...
متن کاملMaximal and Stochastic Galois Lattices
We present a general formula for the intent–extent mappings of a Galois lattice generated by individual descriptions which lie in any arbitrary lattice. The formulation is unique if a natural maximality condition is required. This formulation yields, as particular cases, formal concept binary Galois lattices of Wille, those de0ned by Brito or Blyth–Janowitz, as well as fuzzy or stochastic Galoi...
متن کاملTowards Knowledge Management using Galois Lattices ∗
In this paper we investigate the application of Galois (or concept) lattices on different information or data sources (e.g. web documents or bibliographical items) in order to organise knowledge that can be extracted from the data. This knowledge organisation can then be used for a number of purposes, e.g. knowledge management in an organisation, document retrieval on the Web, etc. Galois latti...
متن کامل